Uniqueness and Minimality of Large Face-Width Embeddings of Graphs
نویسنده
چکیده
Let G be a graph embedded in a surface of genus g. It is shown that if the face-width of the embedding is at least clog(g)/loglog(g), then such an embedding is unique up to Whitney equivalence. If the face-width is at least clog(g), then every embedding of G which is not Whitney equivalent to our embedding has strictly sinaller Euler characteristic.
منابع مشابه
Apex graphs with embeddings of face-width three
Aa apex graph is a graph which has a vertex whose removal makes the resulting graph planar. Embeddings of apex graphs having face-width three are characterized. Surprisingly, there are such embeddings of arbitrarily large genus. This solves a problem of Robertson and Vitray. We also give an elementary proof of a result of Robertson, Seymour, and Thomas 5] that any embedding of an apex graph in ...
متن کاملLabeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کاملFlexibility of Polyhedral Embeddings of Graphs in Surfaces
Whitney s theorem states that connected planar graphs admit essentially unique embeddings in the plane We generalize this result to em beddings of graphs in arbitrary surfaces by showing that there is a function N N such that every connected graph admits at most g combina torially distinct embeddings of face width into surfaces whose Euler genus
متن کاملExistence of Polyhedral Embeddings of Graphs Is Np-complete
It is proved that the decision problem about existence of an embed ding of face width of a given graph is NP complete A similar result is proved for some related decision problems This solves a problem raised by Neil Robertson
متن کاملExistence of Polyhedral Embeddings of Graphs
It is proved that the decision problem about the existence of an embedding of face-width 3 of a given graph is NP-complete. A similar result is proved for some related decision problems. This solves a problem raised by Neil Robertson.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorica
دوره 15 شماره
صفحات -
تاریخ انتشار 1995